A Niching Memetic Algorithm for Multi-Solution Traveling Salesman Problem
نویسندگان
چکیده
منابع مشابه
A memetic algorithm for symmetric traveling salesman problem
A Memetic Algorithm (MA) encompasses a class of approaches with proven practical success in variety of optimization problems aiming to make use of benefits of each individual approach. In this paper, we present a special designed Memetic Algorithm to solve the well-known Symmetric Traveling Salesman Problem (STSP).The main feature of the Memetic Algorithm is to use a local search combined with ...
متن کاملA New Memetic Algorithm for the Asymmetric Traveling Salesman Problem
This paper introduces a new memetic algorithm specialized for the asymmetric instances of the traveling salesman problem (ATSP). The method incorporates a new local search engine and many other features that contribute to its effectiveness, such as: (i) the topological organization of the population as a complete ternary tree with thirteen nodes; (ii) the hierarchical organization of the popula...
متن کاملMemetic Algorithm for the Generalized Asymmetric Traveling Salesman Problem
The generalized traveling salesman problem (GTSP) is an extension of the well-known traveling salesman problem. In GTSP, we are given a partition of cities into groups and we are required to find a minimum length tour that includes exactly one city from each group. The aim of this paper is to present a new memetic algorithm for GTSP which clearly outperforms the state-of-the-art memetic algorit...
متن کاملSolution for Fuzzy Road Transport Traveling Salesman Problem Using Eugenic Bacterial Memetic Algorithm
The aim of the Traveling Salesman Problem (TSP) is to find the cheapest way of visiting all elements in a given set of cities and returning to the starting point. In solutions presented in the literature costs of travel between nodes (cities) are based on Euclidean distances, the problem is symmetric and the costs are constant. In this paper a novel construction and formulation of the TSP is pr...
متن کاملImproving the Solution of Traveling Salesman Problem Using Genetic, Memetic Algorithm and Edge assembly Crossover
The Traveling salesman problem (TSP) is to find a tour of a given number of cities (visiting each city exactly once) where the length of this tour is minimized. Testing every possibility for an N city tour would be N! Math additions. Genetic algorithms (GA) and Memetic algorithms (MA) are a relatively new optimization technique which can be applied to various problems, including those that are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Evolutionary Computation
سال: 2019
ISSN: 1089-778X,1089-778X,1941-0026
DOI: 10.1109/tevc.2019.2936440